A Heuristic for Hybrid Planning with Preferences
نویسندگان
چکیده
In this paper, we introduce an admissible heuristic for hybrid planning with preferences. Hybrid planning is the fusion of hierarchical task network (HTN) planning with partial order causal link (POCL) planning. We consider preferences to be soft goals — facts one would like to see satisfied in a goal state, but which do not have to hold necessarily. Our heuristic estimates the best quality of any solution that can be developed from the current plan under consideration. It can thus be used by any branch-and-bound algorithm that performs search in the space of plans to prune suboptimal plans from the search space.
منابع مشابه
A Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملLPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PDDL3 preferences. Our focus is on computation of relaxed plan based heuristics that effectively guide a planner towards good solutions satisfying preferences. We build on the planner LPRPG, a hybrid relaxed planning graph (RPG)–linear programming (LP) approach. We make extensions to the RPG to rea...
متن کاملA Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملMaximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...
متن کاملProbabilistic Integrated Planning of Primary and Secondary Distribution Networks based on a Hybrid Heuristic and GA Approach
The integrated planning of distribution system reveals a complex and non-linear problem being integrated with integer and discontinues variables. Due to these technical and modeling complexities, many researchers tend to optimize the primary and secondary distribution networks individually which depreciates the accuracy of the results. Accordingly, the integrated planning of these networks is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012